New Computation Technique for Encryption and Decryption Based on Rsa and Elgamal Cryptosystems
نویسندگان
چکیده
Cryptography addresses the necessary elements for secure communication that involved privacy, confidentiality, key exchange, authentication, and non-repudiation. This paper proposed a new computation of encryption and decryption that was based on the computation of RSA and ElGamal Cryptosystems. The RSA is a public key encryption system that gets its security from the difficulty of factoring large numbers. Meanwhile, the security of ElGamal is depends upon the difficulty of a certain problem that was related to compute Discrete Logarithms. The proposed technique shows better computation time compared to both cryptosystems. All computation time for each algorithm also presented at the end of this paper. However, this paper did not present the security of the technique over the RSA and ElGamal.
منابع مشابه
Comparison of two Public Key Cryptosystems
Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملAdaptively Secure Threshold Cryptography without the Assumption of Erasure
We exhibit eecient threshold cryptosystems which are secure against adaptive adversaries even when the players cannot erase their local data. Speciically, we present erasure-free adaptively-secure protocols for distributed decryption in Cramer-Shoup cryptosystem. Our techniques are also applicable for distributing the secret-key operation of other cryptosystems, like RSA, DSS, and ElGamal, as w...
متن کاملCryptosystems for hierarchical groups
This paper addresses the problem of information protection in hierarchical groups. Higher level groups of participants can control the information ow (the decryption ability) to lower level groups. If a higher level group decides to allow a lower level group to read the message, it passes a go ahead ticket so the lower level group can decrypt the cryptogram and read the message. The formal mode...
متن کاملA survey of cryptosystems based on imaginary quadratic orders
Since nobody can guarantee that popular public key cryptosystems based on factoring or the computation of discrete logarithms in some group will stay secure forever, it is important to study different primitives and groups which may be utilized if a popular class of cryptosystems gets broken. A promising candidate for a group in which the DL-problem seems to be hard is the class group Cl(∆) of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012